-
1 Boolean gate
логічний елемент; вентильEnglish-Ukrainian dictionary of microelectronics > Boolean gate
-
2 gate
1. ім.1)логічний елемент; вентиль; логічна схема2) затвор (напр. польового транзистора); керуючий електрод3) пост; робоче місце4) селекторний [стробуючий] імпульс, строб-імпульс2. дієсл. здійснювати селекцію в часі, стробувати - AND gate
- AND–NOR gate
- AND-NOT gate
- AND-OR gate
- back gate
- Boolean gate
- channelless sea gates
- closed-geometry gate
- coincidence gate
- control gate
- digital logic gate
- digital summation threshold logic gate
- discrete gate
- doped polysilicon gate
- double-input gate
- DSTL gate
- emitter-coupled logic gate
- emitter-coupled gate
- equivalent gate
- erase gate
- exclusive NOR gate
- exclusive OR gate
- expandable gate
- fan-in gate
- fan-out gate
- fault-free gate
- faulty gate
- finger gate
- floating gate
- functional gate
- IIL gate
- I2L gate
- imaging gate
- inclusive OR gate
- inspectation gate
- intrinsic gate
- inverting gate
- isolated gate
- Josephson-junction logic gate
- Josephson logic gate
- Josephson tunneling logic gate
- logic gate
- majority gate
- meander gate
- MOS gate
- MOSFET gate
- multiple-level logic gate
- multiple-level gate
- NAND gate
- negation gate
- negative gate
- negative AND gate
- nitride gate
- NOR gate
- NOT gate
- n+ poly gate
- offset gate
- OR gate
- OR–NOT gate
- polycrystalline silicon gate
- polysilicon gate
- process control gate
- QA gate
- quantum interference Joseph-son gate
- recessed gate
- refractory-metal gate
- replicate/annihilate gate
- resistive gate
- Scholtky-barriergate
- Scholtkygate
- Scholtky TTL gate
- sea gates
- self-aligned gate
- self-registered gate
- single-input gate
- single -logic level gate
- single level gate
- single-poly gate
- stacked gate
- storage gate
- transfer gate
- transistor gate
- variable threshold logic gate
- variable threshold gate
- V-groove MOS gate
- p-gate
См. также в других словарях:
Boolean algebra (introduction) — Boolean algebra, developed in 1854 by George Boole in his book An Investigation of the Laws of Thought , is a variant of ordinary algebra as taught in high school. Boolean algebra differs from ordinary algebra in three ways: in the values that… … Wikipedia
Boolean algebras canonically defined — Boolean algebras have been formally defined variously as a kind of lattice and as a kind of ring. This article presents them more neutrally but equally formally as simply the models of the equational theory of two values, and observes the… … Wikipedia
Boolean logic — is a complete system for logical operations. It was named after George Boole, who first defined an algebraic system of logic in the mid 19th century. Boolean logic has many applications in electronics, computer hardware and software, and is the… … Wikipedia
Boolean algebra (logic) — For other uses, see Boolean algebra (disambiguation). Boolean algebra (or Boolean logic) is a logical calculus of truth values, developed by George Boole in the 1840s. It resembles the algebra of real numbers, but with the numeric operations of… … Wikipedia
Boolean algebra — This article discusses the subject referred to as Boolean algebra. For the mathematical objects, see Boolean algebra (structure). Boolean algebra, as developed in 1854 by George Boole in his book An Investigation of the Laws of Thought,[1] is a… … Wikipedia
Boolean algebra (structure) — For an introduction to the subject, see Boolean algebra#Boolean algebras. For the elementary syntax and axiomatics of the subject, see Boolean algebra (logic). For an alternative presentation, see Boolean algebras canonically defined. In abstract … Wikipedia
Boolean circuit — A Boolean circuit is a mathematical model of computation used in studying computational complexity theory. Boolean circuits are the main object of study in circuit complexity. A formal language can be decided by a family of Boolean circuits, one… … Wikipedia
Canonical form (Boolean algebra) — In Boolean algebra, any Boolean function can be expressed in a canonical form using the dual concepts of minterms and maxterms. Minterms are called products because they are the logical AND of a set of variables, and maxterms are called sums… … Wikipedia
Logic gate — A logic gate is an idealized or physical device implementing a Boolean function, that is, it performs a logical operation on one or more logic inputs and produces a single logic output. Depending on the context, the term may refer to an ideal… … Wikipedia
Negated AND gate — This article is about NAND in the sense of an electronic logic gate. For NAND in the purely logical sense, see Sheffer stroke. For other uses of NAND or Nand, see Nand (disambiguation). INPUT A B OUTPUT A NAND B 0 0 1 0 1 1 1 0 … Wikipedia
Toffoli gate — In computer science, the Toffoli gate, invented by Tommaso Toffoli, is a universal reversible logic gate, which means that any reversible circuit can be constructed from Toffoli gates. It is also known as the controlled controlled not gate, which … Wikipedia